MIC2005: The Sixth Metaheuristics International Conference ??-1 An ant colony optimization inspired algorithm for the Set Packing Problem with application to railway infrastructure

Source URL: www.emse.fr

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

Source URL: www.mancoosi.org

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Operations research
• Logic in computer science
• Mathematical optimization
• NP-complete problems
• Boolean algebra
• Maximum satisfiability problem
• Boolean satisfiability problem
• Constraint satisfaction
• Solver

Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

Source URL: disco.ethz.ch

• Computational complexity theory
• Complexity classes
• NP-complete problems
• Operations research
• Combinatorial optimization
• Mathematical optimization
• Knapsack problem
• Reduction
• Graph coloring
• NP-hardness
• NP
• Optimization problem

The Generalized Median Stable Matchings: finding them is not that easy Christine T. Cheng Department of Computer Science University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA.

Source URL: www.cs.uwm.edu

• Mathematics
• Matching
• Combinatorics
• Cooperative games
• Game theory
• Combinatorial optimization
• Stable marriage problem
• Partially ordered set

Thursday 31 March EvoCOP 1 - Real World Applications, 11:30-13:10 Chaired by Francisco Chicano Particle Swarm Optimization for Multi-Objective Web Service Location Allocation,

Source URL: www.evostar.org

• Mathematics
• Operations research
• Computational complexity theory
• Applied mathematics
• Mathematical optimization
• NP-complete problems
• Cybernetics
• Heuristics
• Hyper-heuristic
• Genetic algorithm
• Travelling salesman problem
• Evolutionary algorithm

Second International Conference on Multiagent SystemsDistributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems Makoto Yokoo

Source URL: agent.inf.kyushu-u.ac.jp

• Constraint programming
• Mathematics
• Constraint satisfaction problem
• Constraint satisfaction
• Algorithm
• Shortest path problem
• Theoretical computer science
• Min-conflicts algorithm
• Distributed constraint optimization

Many data analysis applications require the solution of optimization problems involving a sum of large number of functions. We consider the problem of minimizing a sum of n functions over a convex constraint set. Algorit

Source URL: mmds-data.org

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Source URL: emarkou.users.uth.gr

• Graph theory
• Mathematics
• Computational complexity theory
• Operations research
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Edsger W. Dijkstra
• Travelling salesman problem
• A* search algorithm
• Flow network
• Tree traversal

Microsoft Worddoc

Source URL: publik.tuwien.ac.at

• Mathematics
• Routing algorithms
• Edsger W. Dijkstra
• Graph theory
• Applied mathematics
• Search algorithms
• Game artificial intelligence
• Combinatorial optimization
• A* search algorithm
• Shortest path problem
• Maze
• Algorithm

Unique Sink Orientations of Grids ? Bernd G¨artner1 , Walter D. Morris, Jr.2 , and Leo R¨ ust3

Source URL: people.inf.ethz.ch

• Graph theory
• Mathematics
• Geometry
• Convex optimization
• Operations research
• Linear programming
• Polytopes
• Unique sink orientation
• LP-type problem
• Orientation
• Simplex
• Ear decomposition